\section{Conclusion}\label{sec:conclusion}
We presented fast distributed algorithms for computing PageRank, a measure of fundamental interest
in networks. Our algorithms are Monte-Carlo and based on the idea of speeding up random walks
in a distributed network. Our faster algorithm takes time only sub-logarithmic in $n$  which can
be useful in large-scale, resource-constrained, distributed networks, where running time is especially crucial. Since they are based on random walks,
which are lightweight, robust, and local, they can be amenable to self-organizing and dynamic networks.


\section*{Acknowledgments}
We thank the anonymous reviewers  for their detailed comments which helped in improving the presentation
of the paper.


\endinput